The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if there is a computable function f:ω→ω that induces an injective map from R-equivalence classes to S-equivalence classes. In order to compare the complexity of equivalence relations which are computable, researchers considered also feasible variants of computable reducibility, such as the polynomial-time reducibility. (...) In this work, we explore Peq, the degree structure generated by primitive recursive reducibility on primitive recursive equivalence relations with infinitely many equivalence classes. In contrast with all other known degree structures on equivalence relations, we show that Peq has much more structure: e.g., we show that it is a dense distributive lattice. On the other hand, we also offer evidence of the intricacy of Peq, proving, e.g., that the structure is neither rigid nor homogeneous. (shrink)

We make some beginning observations about the category Eq of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations R and S is a mapping from the set of R-equivalence classes to that of S-equivalence classes, which is induced by a computable function. We also consider some full subcategories of Eq, such as the category Eq(Σ01) of computably enumerable equivalence relations (called ceers), the category Eq(Π01) of co-computably enumerable equivalence relations, and the category Eq(Dark*) (...) whose objects are the so-called dark ceers plus the ceers with finitely many equivalence classes. Although in all these categories the monomorphisms coincide with the injective morphisms, we show that in Eq(Σ01) the epimorphisms coincide with the onto morphisms, but in Eq(Π01) there are epimorphisms that are not onto. Moreover, Eq, Eq(Σ01), and Eq(Dark*) are closed under finite products, binary coproducts, and coequalizers, but we give an example of two morphisms in Eq(Π01) whose coequalizer in Eq is not an object of Eq(Π01). (shrink)

It is prima facie uncontroversial that the justification of an assertion amounts to a collection of other (inferentially related) assertions. In this paper, we point at a class of assertions, i.e. mathematical assertions, that appear to systematically flout this principle. To justify a mathematical assertion (e.g. a theorem) is to provide a proof—and proofs are sequences of directives. The claim is backed up by linguistic data on the use of imperatives in proofs, and by a pragmatic analysis of theorems and (...) their proofs. Proofs, we argue, are sequences of instructions whose performance inevitably gets one to truth. It follows that a felicitous theorem, i.e. a theorem that has been correctly proven, is a persuasive theorem. When it comes to mathematical assertions, there is no sharp distinction between illocutionary and perlocutionary success. (shrink)

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation (...) of the natural numbers). We observe, e.g., that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non‐periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non‐commutative and non‐Boolean c.e. ring. (shrink)

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies limit computable sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice. In this paper, we combine the Ershov Hierarchy and fuzzy set (...) theory, by introducing and investigating the Fuzzy Ershov Hierarchy. (shrink)

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice L. In (...) this paper, we combine the Ershov Hierarchy and fuzzy set theory, by introducing and investigating the Fuzzy Ershov Hierarchy. In particular, we focus on the fuzzy n-c.e. sets which form the finite levels of this hierarchy. Intuitively, a fuzzy set is n-c.e. if its membership function can be approximated by changing monotonicity at most n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n-1$$\end{document} times. We prove that the Fuzzy Ershov Hierarchy does not collapse; that, in analogy with the classical case, each fuzzy n-c.e. set can be represented as a Boolean combination of fuzzy c.e. sets; but that, contrary to the classical case, the Fuzzy Ershov Hierarchy does not exhaust the class of all Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} fuzzy sets. (shrink)

We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure A as the family of Turing degrees that compute embeddings between any computable bi-embeddable copies of A; the degree of bi-embeddable categoricity of A is the least degree in this spectrum (if it exists). We extend many known results about categoricity spectra to the case of bi-embeddability. In particular, we exhibit structures without degree of bi-embeddable categoricity, and (...) we show that every degree d.c.e above 0(α) for α a computable successor ordinal and 0(λ) for λ a computable limit ordinal is a degree of bi-embeddable categoricity. We also give examples of families of degrees that are not bi-embeddable categoricity spectra. (shrink)

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility (...) spectrum of computably enumerable equivalence relations with no countable basis and a reducibility spectrum of computably enumerable equivalence relations which is downward dense, thus has no basis. (shrink)

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the learning type InfEx_\iso, consisting of the structures whose isomorphism types can be learned in the limit. We show that a family of structures is InfEx_\iso-learnable if and only if the structures can be distinguished in terms of their \Sigma^2_inf-theories. We apply this characterization to familiar cases and we show the following: there is an infinite (...) learnable family of distributive lattices; no pair of Boolean algebras is learnable; no infinite family of linear orders is learnable. (shrink)

In this paper we argue, against a somewhat standard view, that pragmatic phenomena occur in mathematical language. We provide concrete examples supporting this thesis.

This paper studies algorithmic learning theory applied to algebraic structures. In previous papers, we have defined our framework, where a learner, given a family of structures, receives larger and larger pieces of an arbitrary copy of a structure in the family and, at each stage, is required to output a conjecture about the isomorphism type of such a structure. The learning is successful if there is a learner that eventually stabilizes to a correct conjecture. Here, we analyze the number of (...) mind changes that are needed to learn a given family K. We give a descriptive set-theoretic interpretation of such mind change complexity. We also study how bounding the Turing degree of learners affects the mind change complexity of a given family of algebraic structures. (shrink)

We offer a novel picture of mathematical language from the perspective of speech act theory. There are distinct speech acts within mathematics, and, as we intend to show, distinct illocutionary force indicators as well. Even mathematics in its most formalized version cannot do without some such indicators. This goes against a certain orthodoxy both in contemporary philosophy of mathematics and in speech act theory. As we will comment, the recognition of distinct illocutionary acts within logic and mathematics and the incorporation (...) of illocutionary force indicators in the formal language for both goes back to Frege’s conception of these topics. We are, therefore, going back to a Fregean perspective. This paper is part of a larger project of applying contemporary speech act theory to the scientific language of mathematics in order to uncover the varieties and regular combinations of illocutionary acts present in it. For reasons of space, we here concentrate only on assertive and declarative acts within mathematics, leaving the investigation of other kinds of acts for a future occasion. (shrink)

This paper is part of a project that is based on the notion of a dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In Amidei et al. (2016, Rev. Symb. Logic, 9, 1–26) and Amidei et al. (2016, Rev. Symb. Logic, 9, 299–324), we investigated the expressive and computational power of dialectical systems, and we compared them to a new class of systems, that of quasi-dialectical systems, that enrich Magari’s systems with a natural mechanism (...) of revision. In the present paper we consider a third class of systems, that of p-dialectical systems, that naturally combine features coming from the two other cases. We prove several results about p-dialectical systems and the sets that they represent. Then we focus on the completions of first-order theories. In doing so, we consider systems with connectives, i.e. systems that encode the rules of classical logic. We show that any consistent system with connectives represents the completion of a given theory. We prove that dialectical and q-dialectical systems coincide with respect to the completions that they can represent. Yet, p-dialectical systems are more powerful; we exhibit a p-dialectical system representing a completion of Peano Arithmetic that is neither dialectical nor q-dialectical. (shrink)

We study the algorithmic complexity of isomorphic embeddings between computable structures.

We aim at providing a philosophical analysis of the notion of “proof by Church’s Thesis”, which is – in a nutshell – the conceptual device that permits to rely on informal methods when working in Computability Theory. This notion allows, in most cases, to not specify the background model of computation in which a given algorithm – or a construction – is framed. In pursuing such analysis, we carefully reconstruct the development of this notion (from Post to Rogers, to the (...) present days), and we focus on some classical constructions of the field, such as the construction of a simple set. Then, we make use of this focus in order to support the following encompassing claim (which opposes to a somehow commonly received view): the informal side of Computability, consisting of the large class of methods typically employed in the proofs of the field, is not fully reducible to its formal counterpart. (shrink)

In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power that is needed to learn finite families of structures. In particular, we prove that, if a family of structures is both finite and learnable, then any oracle which computes the Halting set is able to achieve such a learning. On the other hand, we construct (...) a pair of structures which is learnable but no computable learner can learn it. (shrink)

In this paper we focus on the logicality of language, i.e. the idea that the language system contains a deductive device to exclude analytic constructions. Puzzling evidence for the logicality of language comes from acceptable contradictions and tautologies. The standard response in the literature involves assuming that the language system only accesses analyticities that are due to skeletons as opposed to standard logical forms. In this paper we submit evidence in support of alternative accounts of logicality, which reject the stipulation (...) of a natural logic and assume instead the meaning modulation of nonlogical terms. (shrink)

Computably enumerable equivalence relations received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility \. This gives rise to a rich degree structure. In this paper, we lift the study of c-degrees to the \ case. In doing so, we rely on the Ershov hierarchy. For any notation a for a non-zero computable ordinal, we prove several algebraic properties of the degree structure induced by \ on the \ equivalence relations. (...) A special focus of our work is on the existence of infima and suprema of c-degrees. (shrink)

In this short paper, we analyse whether assuming that mathematical objects are “thin” in Linnebo's sense simplifies the epistemology of mathematics. Towards this end, we introduce the notion of transparency and show that not all thin objects are transparent. We end by arguing that, far from being a weakness of thin objects, the lack of transparency of some thin objects is a fruitful characteristic mark of abstract mathematics.

The Friedman–Stanley jump, extensively studied by descriptive set theorists, is a fundamental tool for gauging the complexity of Borel isomorphism relations. This paper focuses on a natural computable analog of this jump operator for equivalence relations on $\omega $, written ${\dotplus }$, recently introduced by Clemens, Coskey, and Krakoff. We offer a thorough analysis of the computable Friedman–Stanley jump and its connections with the hierarchy of countable equivalence relations under the computable reducibility $\leq _c$. In particular, we show that this (...) jump gives benchmark equivalence relations going up the hyperarithmetic hierarchy and we unveil the complicated highness hierarchy that arises from ${\dotplus }$. (shrink)

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, \ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of \ bi-embeddable categoricity and relative \ bi-embeddable categoricity coincide for equivalence structures for \. We also prove that computable equivalence structures have degree of bi-embeddable categoricity \, or \. We furthermore obtain results (...) on the index set complexity of computable equivalence structure with respect to bi-embeddability. (shrink)

We examine the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ of equivalence relations on $\omega $ under computable reducibility. We examine when pairs of degrees have a least upper bound. In particular, we show that sufficiently incomparable pairs of degrees do not have a least upper bound but that some incomparable degrees do, and we characterize the degrees which have a least upper bound with every finite equivalence relation. We show that the natural classes of finite, light, and dark degrees are (...) definable in $\operatorname {\mathrm {\mathbf {ER}}}$. We show that every equivalence relation has continuum many self-full strong minimal covers, and that $\mathbf {d}\oplus \mathbf {\operatorname {\mathrm {\mathbf {Id}}}_1}$ needn’t be a strong minimal cover of a self-full degree $\mathbf {d}$. Finally, we show that the theory of the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ as well as the theories of the substructures of light degrees and of dark degrees are each computably isomorphic with second-order arithmetic. (shrink)

Mauro Basaure Cet article cherche à innover dans le cadre de la controverse sur le musée de la Mémoire et des Droits de l’homme du Chili : devrait-il ou non intégrer dans sa muséographie la période antérieure au 11 septembre 1973, c’est-à-dire le contexte du coup d’État? Je défends la thèse selon laquelle le MMDH peut intégrer une dimension contextuelle sans trahir sa mission, sa vision et sa fonction, tant qu’il répond à une approche de la notion de contexte-sans-causalité. (...) Selon moi, le grand problème de la critique venant de la droite politique – qui accuse le musée de ne pas remplir sa mission pédagogique, car il décontextualise le coup d’État – est que cette critique répond à une vision causale de la notion de contexte, ce qui la conduit à des contradictions insurmontables. Si, grâce à une muséographie bien réfléchie, le concept de contextualisation non causale était mis en oeuvre avec succès, ceci n’engendrerait pas une contradiction au sein du musée mais pourrait même le favoriser. La conviction que le coup d’État et ses atrocités n’ont ni causes ni antécédents et ne peuvent en avoir renforce la mission pédagogique du MMDH. (shrink)

The reception of Avicenna by medieval Jewish readers presents an underappreciated enigma. Despite the philosophical and scientific stature of Avicenna, his philosophical writings were relatively little studied in Jewish milieus, be it in Arabic or in Hebrew. In particular, Avicenna's philosophical writings are not among the “Hebräische Übersetzungen des Mittelalters” – only very few of them were translated into Hebrew. As an author associated with a definite corpus of writings, Avicenna hardly existed in Jewish philosophy in Hebrew. Paradoxically, however, some (...) of Avicenna's most distinctive ideas were widely known and embraced by Jewish philosophers. This is the phenomenon that we dub Avicennian knowledge without Avicenna. In contrast with the philosophical treatises, Avicenna's medical writings were widely and intensively studied by Jews, especially in Hebrew, and remained influential until at least the seventeenth century. The present article presents a comprehensive picture of Avicenna's reception within medieval Jewish cultures in both Arabic and Hebrew and tries to explain the Jews’ complex attitude to Avicenna.La réception d'Avicenne par les érudits juifs médiévaux présente une énigme dont on n'a pas encore pris toute la mesure. Malgré la grande stature scientifique et philosophique d'Avicenne, ses écrits philosophiques ont été peu connus des savants juifs, que ce soit en arabe ou en hébreu. Ils n'ont guère fait partie des “Hebräische Übersetzungen des Mittelalters” – peu seulement ont été traduits en hébreu. En tant qu’auteur associé à un corpus de textes, Avicenne n'existe presque pas dans la philosophie juive en hébreu. Paradoxalement cependant, certaines des idées les plus caractéristiques d'Avicenne étaient bien connues et acceptées par des philosophes juifs. Nous appelons ce phénomène savoir avicennien sans Avicenne. Contrairement aux écrits philosophiques, les ouvrages médicaux d'Avicenne, eux, étaient lus et utilisés par les juifs, notamment en traductions hébraïques, et ce jusqu'au xviie siècle. Cet article présente un tableau général de la réception d'Avicenne, en arabe et en hébreu, dans les différentes cultures juives et il tente d'expliquer l'attitude complexe des savants juifs vis-à-vis d'Avicenne.Send article to KindleTo send this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle. Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply. Find out more about the Kindle Personal Document Service.AVICENNA AMONG MEDIEVAL JEWS THE RECEPTION OF AVICENNA'S PHILOSOPHICAL, SCIENTIFIC AND MEDICAL WRITINGS IN JEWISH CULTURES, EAST AND WESTVolume 22, Issue 2Gad Freudenthal and Mauro Zonta DOI: https://doi.org/10.1017/S0957423912000033Your Kindle email address Please provide your Kindle [email protected]@kindle.com Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Dropbox To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox. AVICENNA AMONG MEDIEVAL JEWS THE RECEPTION OF AVICENNA'S PHILOSOPHICAL, SCIENTIFIC AND MEDICAL WRITINGS IN JEWISH CULTURES, EAST AND WESTVolume 22, Issue 2Gad Freudenthal and Mauro Zonta DOI: https://doi.org/10.1017/S0957423912000033Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Google Drive To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive. AVICENNA AMONG MEDIEVAL JEWS THE RECEPTION OF AVICENNA'S PHILOSOPHICAL, SCIENTIFIC AND MEDICAL WRITINGS IN JEWISH CULTURES, EAST AND WESTVolume 22, Issue 2Gad Freudenthal and Mauro Zonta DOI: https://doi.org/10.1017/S0957423912000033Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Export citation Request permission. (shrink)

Economic and sanitary crises have great repercussions on access to food and the health of the population. In this context, austerity policies can have devastating effects on social rights. The purpose of this essay is to reflect on the impact of various types of crises on the Human Right to Adequate Food and Nutrition (DHANA) and on Food and Nutritional Security (SAN) of vulnerable populations and to identify of public policies, programs and actions developed based on the relief of the (...) damage caused by the COVID-19 pandemic. From the collection of information carried out in a non-systematic way on government websites and scientific databases, documents were read in full, categorized, and critically analyzed. Three different contexts, Africa, Latin America, and Portugal, are presented by the authors who work in these realities, with the intention of contributing to mitigate the food problems that worsen and are derived from the pandemic situation. (shrink)

We offer a review of some of the most influential views on the status of Reichenbach’s Principle of the Common Cause (RPCC) for genuinely indeterministic systems. We first argue that the RPCC is properly a conjunction of two distinct claims, one metaphysical and another methodological. Both claims can and have been contested in the literature, but here we simply assume that the metaphysical claim is correct, in order to focus our analysis on the status of the methodological claim. We briefly (...) review the most entrenched or classical positions, including Salmon’s ‘interactive forks’, van Fraassen’s scepticism, and Cartwright’s generalisation of the fork criterion. We then go on to review the results of the ‘Budapest school’ on the existence of formally defined screening­ off events for any correlation —by means of the ideas of probability space extensibility and (Reichenbachian common cause) completability. We distinguish the Budapest doctrine clearly from any of the classical conceptions, and thus present an overall framework for discussions of causal inference in quantum mechanics. We argue that this review is preliminary essential work for a thorough assessment of the conditions under which RCCP may be a reliable tool for causal inference in a genuinely probabilistic (indeterministic) context. (shrink)

It is still a controversial issue whether Reichenbach’s Principle of the Common Cause (RPCC) is a sound method for causal inference. In fact, the status of the principle has been a subject of intense philosophical debate. An extensive literature has been thus generated both with arguments in favor and against the adequacy of the principle. A remarkable argument against the principle, first proposed by Elliott Sober (Sober, 1987, 2001), consists on a counterexample which involves corelations between bread prices in Britain (...) and sea levels in Venice. The aim of this paper is to put into perspective criticisms to RPCC of the kind of Sober’s in the light of recent formal results regarding the so-called extendability and common cause completability. (shrink)

In the first part of this paper, I try to clear the ground from frequent misconceptions about the relationship between fact and value by examining some uses of the adjective “natural” in ethical controversies. Such uses bear evidence to our “natural” tendency to regard nature (considered in a descriptive sense, as the complex of physical and biological regularities) as the source of ethical norms. I then try to account for the origin of this tendency by offering three related explanations, the (...) most important of which regards it as the outcome of an adaptation: if any behaviour that favours our equilibrium with the environment is potentially adaptive, nothing can be more effective for this goal than developing an attitude toward the natural world that regards it as a dispenser of sacred norms that must be invariably respected. By referring to the Aristotelian notion of human flourishing illustrated in the first part of the paper, in the second I discuss some ethical problems raised by mini-chips implantable under in our bodies. I conclude by defending the potential beneficial effects of such new technological instruments. (shrink)

Critical analyses of current food systems underline the need to respond to important challenges in questions of nutritional health, environmental sustainability, socio-economic development and protection of the cultural wealth. A wide range of perspectives and methodologies were used to carry out those analyses yielding a significant variety of proposals to undertake the challenges. In most of those analyses, the need to transform our current food systems both from the local to the global level is emphasized, paying attention to food chain (...) processes as well as to decision-makers. The analysis presented in this paper reflects specifically on those proposals based on a common aspect: the need to transform the governance of the EU present-day food system, that is, who makes decisions, how are those decisions made, and which changes need to be made to empower food consumers. The introduction of reforms to change these models is proposed. The focus of these proposals, including those that argue in favour of food sovereignty, the human right to food or the acknowledgement of a food citizenship, share, I believe, a common key. All of them advocate transformations in models of food governance on the basis of a series of mechanisms and principles which for centuries have been employed to control power and grant the governed a status digno vis-à-vis those who govern. Within those proposals we may identify an incipient food constitutionalism, which I will address along with the opportunities and obstacles inherent in the current EU Legal Framework. (shrink)

Dworkin claimed that hypothetical agreements are not binding and, thus, that the argument from the Original Position in Rawls’ A Theory of Justice does not justify or ground the principles of justice. I argue that the Original Position is neither foundational nor in need of a “deep theory”, as claims Dworkin; it is only a means of clarification, a sort of “perspicuous representation” of our judgments concerning justice. I also argue that the natural duty of justice works as a non-hypothetical (...) justification for why the principles are binding. This because the natural duty of justice does not depend on agreements to hold and, as such, makes any principle of justice binding. (shrink)

The aim of this paper is to present a reflection on the idea of religiousness or religious sentiment in Benjamin Constant de Rebecque and the importance of this in free societies. For the author, the religious sentiment avoids the evils of selfishness and individualism and, at the same time, the dangers of political despotism and religious. In this sense, religion is seen as necessary to free societies. However, it must be separated from the priestly factions. Constant presents a strategy of (...) fusing a perspective of Enlightenment - with the concepts of progress and civilization - with aspects of the thought of Edmund Burke who advocated a more local interest. Thus, the "Greeks" - an "ideal type" avant la lettre - are presented with real people in history, which can help to think of our civilization. An "intermediate political principle", avoiding the excesses of philosophical abstraction. (shrink)

This paper is a contribution to the general study of consequence relations which contain (definable) connective of “disjunction”. Our work is centered around the “proof by cases property”, we present several of its equivalent definitions, and show some interesting applications, namely in constructing axiomatic systems for intersections of logics and recognizing weakly implicative fuzzy logics among the weakly implicative ones.

Jan WoleĔski Kazimierz Twardowski and the Development of Philosophy of Science in Poland Kazimierz Twardowski studied with Brentano and followed his style of doing philosophy, in particular, the thesis that the method of philosophy is  ...